Ask
Login
TAGGED IN

Theory Of Computation

Follow this tag to get notifications whenever a new post is added

ALL TAGS
0
votes
1
answer
10k
views
1
answer
Distinguish between DFA and NFA
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
1
vote
1
answer
9.6k
views
1
answer
Design a tuning machine as an acceptor for the language {a^n b^m| n, m>=0 and m>=n}
theory of computation updated 2.3 years ago by teamques10 ★ 65k
0
votes
1
answer
8.8k
views
1
answer
Design a Turing Machine to find the value of log 2n, where n is a unary number.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
8.5k
views
1
answer
Eliminate Left recursion in the following grammar (Remove Direct and Indirect recursion) S->AA l B A -> AC | SD | E
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
0
votes
1
answer
8.4k
views
1
answer
For the string aabbabba find the following :
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
8.1k
views
1
answer
Write Short Notes on
theory of computation updated 7.8 years ago by teamques10 ★ 65k
0
votes
1
answer
7.9k
views
1
answer
Design a Turing Machine which accepts all strings of the form 0n1n, n>=1
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
7.9k
views
1
answer
Write regular expression for the following languages.
theory of computation updated 2.3 years ago by pedsangini276 • 4.8k
1
vote
1
answer
7.5k
views
1
answer
Write Short Notes on Chomsky Hierarchy
theory of computation updated 3.5 years ago by teamques10 ★ 65k
1
vote
1
answer
7.1k
views
1
answer
Design DPDA to accept languages L={x {a,b} | Na(x) >Nb(x) }, Na(x) >Nb(x) means number of as are greater than number of bs in string x.
theory of computation updated 2.3 years ago by teamques10 ★ 65k
0
votes
1
answer
6.7k
views
1
answer
Short Note on Rice theorem.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
1
vote
1
answer
6.3k
views
1
answer
Design finite state machine to add 2 binary numbers of equal length
theory of computation updated 5.7 years ago by teamques10 ★ 65k
1
vote
1
answer
5.8k
views
1
answer
Consider the following grammar
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.7k
views
1
answer
Design a PDA that accepts all the strings containing equal number of a and b
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.6k
views
1
answer
State and explain pumping lemma for regular languages. Using pumping lemma prove that the language L={0^n 1^n | n>=0} is not regular.
theory of computation updated 2.3 years ago by teamques10 ★ 65k
0
votes
1
answer
5.5k
views
1
answer
Design a Turing Machine which accepts all strings of the form anbn, n>=1
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.4k
views
1
answer
Convert the following grammar to GNF
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.3k
views
1
answer
Explain with an example Chomsky Normal Form
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.1k
views
1
answer
a. Draw a state diagram and construct a regular expression corresponding to the following state transaction table
theory of computation updated 2.3 years ago by teamques10 ★ 65k
1
vote
1
answer
5.1k
views
1
answer
State and Explain closure properties of Context Free Language.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
5.0k
views
1
answer
Convert following Grammar to CNF and GNF.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
4.7k
views
1
answer
State and prove pumping lemma for context free languages.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
1
vote
1
answer
4.7k
views
1
answer
Give applications of regular expressions
theory of computation updated 3.5 years ago by teamques10 ★ 65k
1
vote
1
answer
4.7k
views
1
answer
Explain post correspondence problem.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
0
votes
1
answer
4.4k
views
1
answer
Short Note On : Recursive and Recursively Enumerable Languages.
theory of computation updated 3.5 years ago by teamques10 ★ 65k
<prev • 104 results • page 2 of 5 • next >